Cancellativity in finitely presented semigroups
نویسندگان
چکیده
منابع مشابه
On Subsemigroups of Finitely Presented Semigroups
The purpose of this paper is to investigate properties of subsemigroups of finitely presented semigroups, particularly with respect to the property of being finitely presented. More precisely, we will consider various instances of the following: Main Problem. Let S be a finitely presented semigroup. Ž . Ž . i Is every subsemigroup ideal, one-sided ideal of S finitely generated? Ž . Ž . ii Is ev...
متن کاملGrowth of Finitely Presented Rees Quotients of Free Inverse Semigroups
We prove that a finitely presented Rees quotient of a free inverse semigroup has polynomial growth if and only if it has bounded height. This occurs if and only if the set of nonzero reduced words has bounded Shirshov height and all nonzero reduced but not cyclically reduced words are nilpotent. This occurs also if and only if the set of nonzero geodesic words have bounded Shirshov height. We a...
متن کاملOn Finitely Presented Expansions of Computably Enumerable Semigroups
Every computable universal algebra has a finitely presented expansion, but there are examples of finitely generated, computably enumerable universal algebras with no finitely presented expansions. It is natural to ask whether such examples can be found in well-known classes of algebras such as groups and semigroups. In this paper, we build an example of a finitely generated, infinite, computabl...
متن کاملA Solvable Conjugacy Problem for Finitely Presented C(3) Semigroups
In his thesis, Remmers [R], introduced semigroup derivation diagrams and used them to prove that the word problem for finitely presented C(3) semigroups was solvable. In this article we introduce the annular analog of semigroup derivation diagrams and use them to demonstrate the solution to a conjugacy problem for finitely presented C(3) semigroups. Version of 5-21-2013
متن کاملCancellativity is undecidable for automatic semigroups
Via an encoding of the Modified Post’s Correspondence Problem, this paper shows that it is undecidable whether an automatic semigroup is cancellative.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1989
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(89)80028-8